Strong edge-coloring of (3, Δ)-bipartite graphs
نویسندگان
چکیده
منابع مشابه
Adjacent Vertex Distinguishing Edge-Colorings
An adjacent vertex distinguishing edge-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set of colors. The minimum number of colors χa(G) required to give G an adjacent vertex distinguishing coloring is studied for graphs with no isolated edge. We prove χa(G) ≤ 5 for such graphs with maximum degree Δ(G) = 3 and prove χa(G) ≤ Δ(G) ...
متن کاملStrong edge-coloring of $(3, \Delta)$-bipartite graphs
A strong edge-coloring of a graph G is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most 3 and the other part is of maximum degree ∆. For every such graph, we prove that a strong 4∆-edge-coloring can always be obtained. Together with a result of Steger and Yu, this result confirms a conj...
متن کاملVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
It was proved that every 3-connected bipartite graph admits a vertex-coloring S-edge-weighting for S = {1, 2} (H. Lu, Q. Yu and C. Zhang, Vertex-coloring 2-edge-weighting of graphs, European J. Combin., 32 (2011), 22-27). In this paper, we show that every 2-connected and 3-edge-connected bipartite graph admits a vertex-coloring S-edgeweighting for S ∈ {{0, 1}, {1, 2}}. These bounds we obtain ar...
متن کاملStrong chromatic index of graphs: a short survey
A strong edge coloring of a graph G is an edge coloring such that every two adjacent edges or two edges adjacent to a same edge receive two distinct colors; in other words, every path of length three has three distinct colors in G. The strong chromatic index of G, denoted by S G , is the smallest integer k such that G admits a strong edge coloring with k colors. This survey is an brief i...
متن کاملWeighted coloring on planar, bipartite and split graphs: Complexity and approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-hard in planar graphs, even if they are triangle-free and their maximum degree is bounded above by 4. Then, we prove that min weighted node coloring is NP-hard in P8-free bipartite graphs, but polynomial for P5-free bipartite graphs. We next focus on approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 339 شماره
صفحات -
تاریخ انتشار 2016